Mining OO Framework Hot-Spot Instantiation Pattern Based on MSE Tree
نویسندگان
چکیده
منابع مشابه
Constraint-based Tree Pattern Mining
Most work on pattern mining focus on simple data structures like itemsets or sequences of itemsets. However, a lot of recent applications dealing with complex data like chemical compounds, protein structure, XML and Web Log databases, social network, require much more sophisticated data structures (trees or graphs) for their specification. Here, interesting patterns involve not only frequent ob...
متن کاملHot-Spot-Driven Framework Development
Most excellent object-oriented frameworks are still the product of a more or less chaotic development process, typically carried out in the realm of research-like settings. Overall, flexibility has to be injected into a framework in appropriate doses1. Framework adaptation takes place at points of predefined refinement that we call hot spots. As the quality of a framework depends directly on th...
متن کاملA Combintorial Tree based Frequent Pattern Mining
Frequent pattern mining is a process of extracting frequently occurring itemset patterns from very large data storages. These frequent patterns are used to generate association rules which define the relationship among items. The strength of the relationship can be measured using two different units namely support value and confidence level. Any relationship that satisfies minimum threshold of ...
متن کاملEfficient Frequent Pattern Mining Based on a Condensed Tree Structure
In this paper, we present an efficient tree structure and its associated algorithm for discovery of frequent patterns from a large data set. We demonstrate the effectiveness of our algorithm and performance improvement over the existing approach CATS which is one of the fastest frequent pattern mining algorithms known to date.
متن کاملBasic Framework of CATSIM Tree for Efficient Frequent Pattern Mining
Finding frequent patterns from databases have been the most time consuming process in association rule mining. Several effective data structures, such as two-dimensional arrays, graphs, trees and tries have been proposed to collect candidate itemsets and frequent itemsets. It seems that the tree structure is most extractive to storing itemsets. The outstanding tree has been proposed so far is c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Energy Procedia
سال: 2011
ISSN: 1876-6102
DOI: 10.1016/j.egypro.2011.10.213